Numerical Algorithms for Time - Fractional Subdiffusion

This article aims to fill in the gap of the second-order accurate schemes for the time-fractional subdiffusion equation with unconditional stability. Two fully discrete schemes are first proposed for the time-fractional subdiffusion equation with space discretized by finite element and time discretized by the fractional linear multistep methods. These two methods are unconditionally stable with maximum global convergence order of O(τ + hr+1) in the L2 norm, where τ and h are the step sizes in time and space, respectively, and r is the degree of the piecewise polynomial space. The average convergence rates for the two methods in time are also investigated, which shows that the average convergence rates of the two methods are O(τ1.5 + hr+1). Furthermore, two improved algorithms are constrcted, they are also unconditionally stable and convergent of order O(τ2 + hr+1). Numerical examples are provided to verify the theoretical analysis. The comparisons between the present algorithms and the existing ones are included, which show that our numerical algorithms exhibit better performances than the known ones.